A Combinatorial Scheme for Developing Efficient Composite Solvers
نویسندگان
چکیده
Many fundamental problems in scientific computing have more than one solution method. It is not uncommon for alternative solution methods to represent different tradeoffs between solution cost and reliability. Furthermore, the performance of a solution method often depends on the numerical properties of the problem instance and thus can vary dramatically across application domains. In such situations, it is natural to consider the construction of a multi-method composite solver to potentially improve both the average performance and reliability. In this paper, we provide a combinatorial framework for developing such composite solvers. We provide analytical results for obtaining an optimal composite from a set of methods with normalized measures of performance and reliability. Our empirical results demonstrate the effectiveness of such optimal composites for solving large, sparse linear systems of equations.
منابع مشابه
Faster PDE-based simulations using robust composite linear solvers
Many large-scale scientific simulations require the solution of nonlinear partial differential equations (PDEs). The effective solution of such nonlinear PDEs depends to a large extent on efficient and robust sparse linear system solution. In this paper, we show how fast and reliable sparse linear solvers can be composed from several underlying linear solution methods. We present a combinatoria...
متن کاملA Composite Finite Difference Scheme for Subsonic Transonic Flows (RESEARCH NOTE).
This paper presents a simple and computationally-efficient algorithm for solving steady two-dimensional subsonic and transonic compressible flow over an airfoil. This work uses an interactive viscous-inviscid solution by incorporating the viscous effects in a thin shear-layer. Boundary-layer approximation reduces the Navier-Stokes equations to a parabolic set of coupled, non-linear partial diff...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملViscous Models Comparison in Water Impact of Twin 2D Falling Wedges Simulation by Different Numerical Solvers
In this paper, symmetric water entry of twin wedges is investigated for deadrise angle of 30 degree. Three numerical simulation of a symmetric impact, considering rigid body dynamic equations of motion in two-phase flow is presented. The two-phase flow around the wedges is solved by Finite Element based on Finite Volume method (FEM-FVM) which is used in conjunction with Volume of Fluid (VOF) sc...
متن کاملEfficient Propagation of Disjunctive Constraints using Watched Literals
Efficient constraint propagation is important for all constraint solvers. One of the key reasons that Boolean Satisfiability solvers are often more efficient than constraint solvers is that they can propagate disjunctive constraints efficiently. This propagation is undertaken using the watched literals mechanism. In a recent paper Gent et al. showed how watched literals can be used in constrain...
متن کامل